math/big.nat.cmp (method)

34 uses

	math/big (current package)
		int.go#L150: 		if x.abs.cmp(y.abs) >= 0 {
		int.go#L171: 		if x.abs.cmp(y.abs) >= 0 {
		int.go#L387: 		r = x.abs.cmp(y.abs)
		int.go#L404: 	return x.abs.cmp(y.abs)
		int.go#L778: 	if A.abs.cmp(B.abs) < 0 {
		nat.go#L151: func (x nat) cmp(y nat) (r int) {
		nat.go#L614: 		if z.cmp(limit) < 0 {
		nat.go#L964: 	if zz.cmp(m) >= 0 {
		nat.go#L973: 		if zz.cmp(m) >= 0 {
		nat.go#L1045: 	if x.cmp(natOne) <= 0 {
		nat.go#L1070: 		if z2.cmp(z1) >= 0 {
		nat.go#L1100: 	if x.cmp(y) >= 0 {
		natconv.go#L418: 			if table[index].nbits >= maxLength && table[index].bbb.cmp(q) >= 0 {
		natdiv.go#L532: 	if u.cmp(v) < 0 {
		natdiv.go#L833: 			e := qhatv.cmp(uu.norm())
		natdiv.go#L844: 		if qhatv.cmp(uu.norm()) > 0 {
		natdiv.go#L870: 		if e := qhatv.cmp(u.norm()); e > 0 {
		natdiv.go#L879: 	if qhatv.cmp(u.norm()) > 0 {
		natmul.go#L224: 		if z.cmp(zz) != 0 {
		natmul.go#L311: 		if z.cmp(zz) != 0 {
		prime.go#L109: 		if y.cmp(natOne) == 0 || y.cmp(nm1) == 0 {
		prime.go#L115: 			if y.cmp(nm1) == 0 {
		prime.go#L118: 			if y.cmp(natOne) == 0 {
		prime.go#L154: 	if len(n) == 0 || n.cmp(natOne) == 0 {
		prime.go#L160: 		return n.cmp(natTwo) == 0
		prime.go#L200: 			if t1.cmp(n) == 0 {
		prime.go#L282: 	if vk.cmp(natTwo) == 0 || vk.cmp(nm2) == 0 {
		prime.go#L292: 		if t1.cmp(t2) < 0 {
		rat.go#L404: 	return len(x.b.abs) == 0 || x.b.abs.cmp(natOne) == 0
		ratconv.go#L363: 	if x.b.abs.cmp(r2) <= 0 {
		ratconv.go#L365: 		if r.cmp(p) >= 0 {
		ratconv.go#L467: 	return int(max(p2, p5)), q.cmp(natOne) == 0